Construction of Rough Graph through Rough Membership Function
نویسندگان
چکیده
Rough membership function defines the degree of relationship between conditional and decision attributes an information system. It is defined by where src=image/13429145_07.gif> subset src=image/13429145_08.gif> under relation src=image/13429145_09.gif> universe discourse. can be expressed in different forms like cardinality form, probabilistic form etc. In it as src=image/13429145_02.gif> denoted src=image/13429145_03.gif> src=image/13429145_04.gif> equivalence class src=image/13429145_10.gif> with respect to src=image/13429145_09.gif>. This used measure value uncertainty. this paper we have introduced concept graphical representation rough sets. graph was He Tong 2006. paper, propose a novel method for construction through src=image/13429145_05.gif>. We that there edge vertices if src=image/13429145_06.gif>. The being constructed system; here objects are considered vertices. path, cycle, ladder paper. develop operations on also extend properties graph.
منابع مشابه
Basic Properties of Rough Sets and Rough Membership Function
Let A be a set. One can verify that 〈A, idA〉 is discrete. The following proposition is true (1) For every set X such that ∇X ⊆ idX holds X is trivial. Let A be a relational structure. We say that A is diagonal if and only if: (Def. 1) The internal relation of A ⊆ idthe carrier of A. Let A be a non trivial set. Observe that 〈A,∇A〉 is non diagonal. We now state the proposition (2) For every refle...
متن کاملBasic Properties of Rough Sets and Rough Membership Function1
(1) For every set X such that ∇X ⊆ idX holds X is trivial. Let A be a relational structure. We say that A is diagonal if and only if: (Def. 1) The internal relation of A ⊆ idthe carrier of A. Let A be a non trivial set. Observe that 〈A,∇A〉 is non diagonal. Next we state the proposition (2) For every reflexive relational structure L holds idthe carrier of L ⊆ the internal relation of L. One can ...
متن کاملFuzzy Attribute Dependency of a Rough Set through Flow Graph
In this paper we made an attempt to study the attribute dependency in a rough set. For a given Information system I = (U,A), where U is distinct set of objects and A is the set of attributes such that for each a in A, a μ is a fuzzy set defined on U. i.e., → U a : μ [0,1]. Then we define a fuzzy compatibility relation on A. This relation leads us to get the compatibility classes of the attribut...
متن کاملCluster-Based Rough Set Construction
In many data mining applications, cluster analysis is widely used and its results are expected to be interpretable, comprehensible, and usable. Rough set theory is one of the techniques to induce decision rules and manage inconsistent and incomplete information. This paper proposes a method to construct equivalence classes during the clustering process, isolate outlier points and finally deduce...
متن کاملA Rough Differentiable Function
A real-valued continuously differentiable function f on the unit interval is constructed such that ∞ ∑ k=1 βf (x, 2 −k) = ∞ holds for every x ∈ [0, 1]. Here βf (x, 2−k) measures the distance of f to the best approximating linear function at scale 2−k around x.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics and Statistics
سال: 2022
ISSN: ['2332-2144', '2332-2071']
DOI: https://doi.org/10.13189/ms.2022.100622